Online Computation of Critical Paths for Multithreaded Languages
نویسندگان
چکیده
We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at runtime. Our scheme gives not only the length (execution time) of the critical path but also the lengths and locations of all the subpaths making up the critical path. Although the scheme is like Cilk's algorithm in that it uses a \longest path" computation, it allows more exible synchronization. We implemented our scheme on top of the concurrent object-oriented language Schematic and con rmed its e ectiveness through experiments on a 64-processor symmetric multiprocessor.
منابع مشابه
A Comparison of Different Multithreading Architectures
A new direction in the research of automatic extraction of parallelism from sequential high level languages focuses on the concurrent execution of multiple threads, i.e. multithreaded architectures. The interest for architectures that are able to follow multiple control paths is stimulated by reaching the border of available parallelism for single thread architectures. On the other hand, there ...
متن کاملProgramming Parallel Applications in
Cilk (pronounced \silk") is a C-based language for multithreaded parallel programming. Cilk makes it easy to program irregular parallel applications, especially as compared with data-parallel or message-passing programming systems. A Cilk programmer need not worry about protocols and load balancing, which are handled by Cilk's provably eecient runtime system. Many regular and irregular Cilk app...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملDynamic Multithreaded Algorithms A Minicourse on Dynamic Multithreaded Algorithms
This tutorial teaches dynamic multithreaded algorithms using a Cilk-like [11, 8, 10] model. The material was taught in the MIT undergraduate class 6.046 Introduction to Algorithms as two 80-minute lectures. The style of the lecture notes follows that of the textbook by Cormen, Leiserson, Rivest, and Stein [7], but the pseudocode from that textbook has been “Cilkified” to allow it to describe mu...
متن کاملApplication of Algebraic Techniques to Compute the Eeciency Measure for Multithreaded Architectures
In this paper, we adopt an algebraic point of view for the computation of the eeciency measure of a system of n 1 threads. We deene naturally the eeciency of a \word" as the quotient of the number of \running letters" in the word by its length. We generalize this deenition to a language and we prove that the eeciency can be computed in a modular way for languages we consider. In doing this, we ...
متن کامل